0.11/0.17	% Problem    : Vampire---4.8_553 : TPTP v0.0.0. Released v0.0.0.
0.17/0.18	% Command    : run_E %s %d THM
0.18/0.39	% Computer : n021.cluster.edu
0.18/0.39	% Model    : x86_64 x86_64
0.18/0.39	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.18/0.39	% Memory   : 8042.1875MB
0.18/0.39	% OS       : Linux 3.10.0-693.el7.x86_64
0.18/0.39	% CPULimit   : 1440
0.18/0.39	% WCLimit    : 180
0.18/0.39	% DateTime   : Mon Jul  3 13:01:07 EDT 2023
0.18/0.39	% CPUTime    : 
0.43/0.59	Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553
0.43/0.59	# Version: 3.1pre001-ho
4.59/1.17	# Preprocessing class: HSLMSMSMLLLCHSA.
4.59/1.17	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
4.59/1.17	# Starting pre_casc_4 with 720s (4) cores
4.59/1.17	# Starting full_lambda_6 with 180s (1) cores
4.59/1.17	# Starting sh10 with 180s (1) cores
4.59/1.17	# Starting post_as_ho9 with 180s (1) cores
4.59/1.17	# Starting post_as_ho8 with 180s (1) cores
4.59/1.17	# post_as_ho8 with pid 764 completed with status 0
4.59/1.17	# Result found by post_as_ho8
4.59/1.17	# Preprocessing class: HSLMSMSMLLLCHSA.
4.59/1.17	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
4.59/1.17	# Starting pre_casc_4 with 720s (4) cores
4.59/1.17	# Starting full_lambda_6 with 180s (1) cores
4.59/1.17	# Starting sh10 with 180s (1) cores
4.59/1.17	# Starting post_as_ho9 with 180s (1) cores
4.59/1.17	# Starting post_as_ho8 with 180s (1) cores
4.59/1.17	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
4.59/1.17	# Search class: HGHSM-FSLM31-MHSMMFBN
4.59/1.17	# partial match(1): HGHSM-FSLM31-MHSMMSBN
4.59/1.17	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
4.59/1.17	# Starting new_ho_10_cnf2 with 94s (1) cores
4.59/1.17	# new_ho_10_cnf2 with pid 771 completed with status 0
4.59/1.17	# Result found by new_ho_10_cnf2
4.59/1.17	# Preprocessing class: HSLMSMSMLLLCHSA.
4.59/1.17	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
4.59/1.17	# Starting pre_casc_4 with 720s (4) cores
4.59/1.17	# Starting full_lambda_6 with 180s (1) cores
4.59/1.17	# Starting sh10 with 180s (1) cores
4.59/1.17	# Starting post_as_ho9 with 180s (1) cores
4.59/1.17	# Starting post_as_ho8 with 180s (1) cores
4.59/1.17	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
4.59/1.17	# Search class: HGHSM-FSLM31-MHSMMFBN
4.59/1.17	# partial match(1): HGHSM-FSLM31-MHSMMSBN
4.59/1.17	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
4.59/1.17	# Starting new_ho_10_cnf2 with 94s (1) cores
4.59/1.17	# Preprocessing time       : 0.007 s
4.59/1.17	# Presaturation interreduction done
4.59/1.17	
4.59/1.17	# Proof found!
4.59/1.17	# SZS status Theorem
4.59/1.17	# SZS output start CNFRefutation
4.59/1.17	thf(decl_22, type, is_of: $i > ($i > $o) > $o).
4.59/1.17	thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o).
4.59/1.17	thf(decl_25, type, in: $i > $i > $o).
4.59/1.17	thf(decl_61, type, imp: $o > $o > $o).
4.59/1.17	thf(decl_62, type, d_not: $o > $o).
4.59/1.17	thf(decl_67, type, l_or: $o > $o > $o).
4.59/1.17	thf(decl_77, type, e_is: $i > $i > $i > $o).
4.59/1.17	thf(decl_123, type, nat: $i).
4.59/1.17	thf(decl_124, type, n_is: $i > $i > $o).
4.59/1.17	thf(decl_127, type, n_some: ($i > $o) > $o).
4.59/1.17	thf(decl_147, type, diffprop: $i > $i > $i > $o).
4.59/1.17	thf(decl_148, type, d_29_ii: $i > $i > $o).
4.59/1.17	thf(decl_149, type, iii: $i > $i > $o).
4.59/1.17	thf(decl_162, type, n_ts: $i > $i > $i).
4.59/1.17	thf(decl_189, type, frac: $i).
4.59/1.17	thf(decl_191, type, num: $i > $i).
4.59/1.17	thf(decl_192, type, den: $i > $i).
4.59/1.17	thf(decl_193, type, n_eq: $i > $i > $o).
4.59/1.17	thf(decl_194, type, moref: $i > $i > $o).
4.59/1.17	thf(decl_195, type, lessf: $i > $i > $o).
4.59/1.17	thf(decl_197, type, lesseq: $i > $i > $o).
4.59/1.17	thf(decl_198, type, esk1_0: $i).
4.59/1.17	thf(decl_199, type, esk2_0: $i).
4.59/1.17	thf(decl_200, type, esk3_0: $i).
4.59/1.17	thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', def_d_not)).
4.59/1.17	thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', def_imp)).
4.59/1.17	thf(def_lessf, axiom, ((lessf)=(^[X1:$i, X220:$i]:((iii @ (n_ts @ (num @ X1) @ (den @ X220)) @ (n_ts @ (num @ X220) @ (den @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', def_lessf)).
4.59/1.17	thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', def_iii)).
4.59/1.17	thf(def_n_eq, axiom, ((n_eq)=(^[X1:$i, X218:$i]:((n_is @ (n_ts @ (num @ X1) @ (den @ X218)) @ (n_ts @ (num @ X218) @ (den @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', def_n_eq)).
4.59/1.17	thf(def_l_or, axiom, ((l_or)=(^[X42:$o]:(imp @ ((d_not @ ((X42))))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', def_l_or)).
4.59/1.17	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', def_all_of)).
4.59/1.17	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', def_is_of)).
4.59/1.17	thf(def_moref, axiom, ((moref)=(^[X1:$i, X219:$i]:((d_29_ii @ (n_ts @ (num @ X1) @ (den @ X219)) @ (n_ts @ (num @ X219) @ (den @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', def_moref)).
4.59/1.17	thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', def_d_29_ii)).
4.59/1.17	thf(def_lesseq, axiom, ((lesseq)=(^[X1:$i, X222:$i]:((l_or @ ((lessf @ X1 @ X222)) @ ((n_eq @ X1 @ X222)))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', def_lesseq)).
4.59/1.17	thf(def_n_is, axiom, ((n_is)=(e_is @ nat)), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', def_n_is)).
4.59/1.17	thf(satz41g, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X394:$i]:((in @ X394 @ frac))) @ (^[X395:$i]:(((moref @ X1 @ X395)=>(d_not @ ((lesseq @ X1 @ X395)))))))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', satz41g)).
4.59/1.17	thf(satz52, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X375:$i]:((in @ X375 @ frac))) @ (^[X376:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ frac))) @ (^[X4:$i]:((((lesseq @ X376 @ X4)=>(lesseq @ X1 @ X4))<=(lesseq @ X1 @ X376))))))))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', satz52)).
4.59/1.17	thf(satz41k, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X353:$i]:((in @ X353 @ frac))) @ (^[X354:$i]:(((moref @ X1 @ X354)<=(d_not @ ((lesseq @ X1 @ X354)))))))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', satz41k)).
4.59/1.17	thf(satz51a, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X400:$i]:((in @ X400 @ frac))) @ (^[X401:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ frac))) @ (^[X4:$i]:((((lessf @ X401 @ X4)=>(lessf @ X1 @ X4))<=(lesseq @ X1 @ X401))))))))))), file('/export/starexec/sandbox2/tmp/tmp.BQGiFeDoM8/Vampire---4.8_553', satz51a)).
4.59/1.17	thf(c_0_16, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])).
4.59/1.17	thf(c_0_17, plain, ((imp)=(^[Z0/* 19 */:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])).
4.59/1.17	thf(c_0_18, plain, ((lessf)=(^[Z0/* 19 */:$i, Z1:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ (n_ts @ (num @ Z0) @ (den @ Z1)))))))), inference(fof_simplification,[status(thm)],[def_lessf])).
4.59/1.17	thf(c_0_19, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((n_some @ (diffprop @ Z1 @ Z0))))), inference(fof_simplification,[status(thm)],[def_iii])).
4.59/1.17	thf(c_0_20, plain, ((n_eq)=(^[Z0/* 19 */:$i, Z1:$i]:((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))), inference(fof_simplification,[status(thm)],[def_n_eq])).
4.59/1.17	thf(c_0_21, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(fof_simplification,[status(thm)],[def_l_or])).
4.59/1.17	thf(c_0_22, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_16, c_0_17])).
4.59/1.17	thf(c_0_23, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
4.59/1.17	thf(c_0_24, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
4.59/1.17	thf(c_0_25, plain, ((moref)=(^[Z0/* 19 */:$i, Z1:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))))), inference(fof_simplification,[status(thm)],[def_moref])).
4.59/1.17	thf(c_0_26, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((n_some @ (diffprop @ Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])).
4.59/1.17	thf(c_0_27, plain, ((lesseq)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((n_some @ (diffprop @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ (n_ts @ (num @ Z0) @ (den @ Z1))))))))=>(~($true)))))=>(((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))))))), inference(fof_simplification,[status(thm)],[def_lesseq])).
4.59/1.17	thf(c_0_28, plain, ((lessf)=(^[Z0/* 19 */:$i, Z1:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ (n_ts @ (num @ Z0) @ (den @ Z1)))))))), inference(apply_def,[status(thm)],[c_0_18, c_0_19])).
4.59/1.17	thf(c_0_29, plain, ((n_eq)=(^[Z0/* 19 */:$i, Z1:$i]:((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))), inference(apply_def,[status(thm)],[c_0_20, def_n_is])).
4.59/1.17	thf(c_0_30, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_21, c_0_17]), c_0_22])).
4.59/1.17	thf(c_0_31, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_23, c_0_24])).
4.59/1.17	thf(c_0_32, plain, ((moref)=(^[Z0/* 19 */:$i, Z1:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))))), inference(apply_def,[status(thm)],[c_0_25, c_0_26])).
4.59/1.17	thf(c_0_33, plain, ((lesseq)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((n_some @ (diffprop @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ (n_ts @ (num @ Z0) @ (den @ Z1))))))))=>(~($true)))))=>(((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_27, c_0_28]), c_0_29]), c_0_30])).
4.59/1.17	thf(c_0_34, plain, ![X550:$i]:(((in @ X550 @ frac)=>![X549:$i]:(((in @ X549 @ frac)=>((n_some @ (diffprop @ (n_ts @ (num @ X550) @ (den @ X549)) @ (n_ts @ (num @ X549) @ (den @ X550))))=>~((~(n_some @ (diffprop @ (n_ts @ (num @ X549) @ (den @ X550)) @ (n_ts @ (num @ X550) @ (den @ X549))))=>(e_is @ nat @ (n_ts @ (num @ X550) @ (den @ X549)) @ (n_ts @ (num @ X549) @ (den @ X550)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz41g]), c_0_31]), c_0_32]), c_0_22]), c_0_33])])).
4.59/1.17	thf(c_0_35, negated_conjecture, ~(![X542:$i]:(((in @ X542 @ frac)=>![X541:$i]:(((in @ X541 @ frac)=>![X540:$i]:(((in @ X540 @ frac)=>((~(n_some @ (diffprop @ (n_ts @ (num @ X541) @ (den @ X542)) @ (n_ts @ (num @ X542) @ (den @ X541))))=>(e_is @ nat @ (n_ts @ (num @ X542) @ (den @ X541)) @ (n_ts @ (num @ X541) @ (den @ X542))))=>((~(n_some @ (diffprop @ (n_ts @ (num @ X540) @ (den @ X541)) @ (n_ts @ (num @ X541) @ (den @ X540))))=>(e_is @ nat @ (n_ts @ (num @ X541) @ (den @ X540)) @ (n_ts @ (num @ X540) @ (den @ X541))))=>(~(n_some @ (diffprop @ (n_ts @ (num @ X540) @ (den @ X542)) @ (n_ts @ (num @ X542) @ (den @ X540))))=>(e_is @ nat @ (n_ts @ (num @ X542) @ (den @ X540)) @ (n_ts @ (num @ X540) @ (den @ X542))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz52])]), c_0_31]), c_0_33])])).
4.59/1.17	thf(c_0_36, plain, ![X544:$i]:(((in @ X544 @ frac)=>![X543:$i]:(((in @ X543 @ frac)=>(~((~(n_some @ (diffprop @ (n_ts @ (num @ X543) @ (den @ X544)) @ (n_ts @ (num @ X544) @ (den @ X543))))=>(e_is @ nat @ (n_ts @ (num @ X544) @ (den @ X543)) @ (n_ts @ (num @ X543) @ (den @ X544)))))=>(n_some @ (diffprop @ (n_ts @ (num @ X544) @ (den @ X543)) @ (n_ts @ (num @ X543) @ (den @ X544))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz41k]), c_0_31]), c_0_32]), c_0_22]), c_0_33])])).
4.59/1.17	thf(c_0_37, plain, ![X553:$i]:(((in @ X553 @ frac)=>![X552:$i]:(((in @ X552 @ frac)=>![X551:$i]:(((in @ X551 @ frac)=>((~(n_some @ (diffprop @ (n_ts @ (num @ X552) @ (den @ X553)) @ (n_ts @ (num @ X553) @ (den @ X552))))=>(e_is @ nat @ (n_ts @ (num @ X553) @ (den @ X552)) @ (n_ts @ (num @ X552) @ (den @ X553))))=>((n_some @ (diffprop @ (n_ts @ (num @ X551) @ (den @ X552)) @ (n_ts @ (num @ X552) @ (den @ X551))))=>(n_some @ (diffprop @ (n_ts @ (num @ X551) @ (den @ X553)) @ (n_ts @ (num @ X553) @ (den @ X551)))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz51a]), c_0_31]), c_0_28]), c_0_33])])).
4.59/1.17	thf(c_0_38, plain, ![X898:$i, X899:$i]:(((~(n_some @ (diffprop @ (n_ts @ (num @ X899) @ (den @ X898)) @ (n_ts @ (num @ X898) @ (den @ X899))))|~(n_some @ (diffprop @ (n_ts @ (num @ X898) @ (den @ X899)) @ (n_ts @ (num @ X899) @ (den @ X898))))|~(in @ X899 @ frac)|~(in @ X898 @ frac))&(~(e_is @ nat @ (n_ts @ (num @ X898) @ (den @ X899)) @ (n_ts @ (num @ X899) @ (den @ X898)))|~(n_some @ (diffprop @ (n_ts @ (num @ X898) @ (den @ X899)) @ (n_ts @ (num @ X899) @ (den @ X898))))|~(in @ X899 @ frac)|~(in @ X898 @ frac)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])])).
4.59/1.17	thf(c_0_39, negated_conjecture, ((in @ esk1_0 @ frac)&((in @ esk2_0 @ frac)&((in @ esk3_0 @ frac)&(((n_some @ (diffprop @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)) @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0))))|(e_is @ nat @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0))))&(((n_some @ (diffprop @ (n_ts @ (num @ esk3_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk3_0))))|(e_is @ nat @ (n_ts @ (num @ esk2_0) @ (den @ esk3_0)) @ (n_ts @ (num @ esk3_0) @ (den @ esk2_0))))&(~(n_some @ (diffprop @ (n_ts @ (num @ esk3_0) @ (den @ esk1_0)) @ (n_ts @ (num @ esk1_0) @ (den @ esk3_0))))&~(e_is @ nat @ (n_ts @ (num @ esk1_0) @ (den @ esk3_0)) @ (n_ts @ (num @ esk3_0) @ (den @ esk1_0))))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])).
4.59/1.17	thf(c_0_40, plain, ![X892:$i, X893:$i]:((~(in @ X892 @ frac)|(~(in @ X893 @ frac)|((n_some @ (diffprop @ (n_ts @ (num @ X893) @ (den @ X892)) @ (n_ts @ (num @ X892) @ (den @ X893))))|(e_is @ nat @ (n_ts @ (num @ X892) @ (den @ X893)) @ (n_ts @ (num @ X893) @ (den @ X892)))|(n_some @ (diffprop @ (n_ts @ (num @ X892) @ (den @ X893)) @ (n_ts @ (num @ X893) @ (den @ X892)))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])).
4.59/1.17	thf(c_0_41, plain, ![X900:$i, X901:$i, X902:$i]:(((~(n_some @ (diffprop @ (n_ts @ (num @ X901) @ (den @ X900)) @ (n_ts @ (num @ X900) @ (den @ X901))))|(~(n_some @ (diffprop @ (n_ts @ (num @ X902) @ (den @ X901)) @ (n_ts @ (num @ X901) @ (den @ X902))))|(n_some @ (diffprop @ (n_ts @ (num @ X902) @ (den @ X900)) @ (n_ts @ (num @ X900) @ (den @ X902)))))|~(in @ X902 @ frac)|~(in @ X901 @ frac)|~(in @ X900 @ frac))&(~(e_is @ nat @ (n_ts @ (num @ X900) @ (den @ X901)) @ (n_ts @ (num @ X901) @ (den @ X900)))|(~(n_some @ (diffprop @ (n_ts @ (num @ X902) @ (den @ X901)) @ (n_ts @ (num @ X901) @ (den @ X902))))|(n_some @ (diffprop @ (n_ts @ (num @ X902) @ (den @ X900)) @ (n_ts @ (num @ X900) @ (den @ X902)))))|~(in @ X902 @ frac)|~(in @ X901 @ frac)|~(in @ X900 @ frac)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])])).
4.59/1.17	thf(c_0_42, plain, ![X4:$i, X1:$i]:((~((e_is @ nat @ (n_ts @ (num @ X1) @ (den @ X4)) @ (n_ts @ (num @ X4) @ (den @ X1))))|~((n_some @ (diffprop @ (n_ts @ (num @ X1) @ (den @ X4)) @ (n_ts @ (num @ X4) @ (den @ X1)))))|~((in @ X4 @ frac))|~((in @ X1 @ frac)))), inference(split_conjunct,[status(thm)],[c_0_38])).
4.59/1.17	thf(c_0_43, negated_conjecture, ((n_some @ (diffprop @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)) @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0))))|(e_is @ nat @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_39])).
4.59/1.17	thf(c_0_44, negated_conjecture, (in @ esk2_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_39])).
4.59/1.17	thf(c_0_45, negated_conjecture, (in @ esk1_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_39])).
4.59/1.17	thf(c_0_46, negated_conjecture, ~((e_is @ nat @ (n_ts @ (num @ esk1_0) @ (den @ esk3_0)) @ (n_ts @ (num @ esk3_0) @ (den @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_39])).
4.59/1.17	thf(c_0_47, plain, ![X1:$i, X4:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ X4) @ (den @ X1)) @ (n_ts @ (num @ X1) @ (den @ X4))))|(e_is @ nat @ (n_ts @ (num @ X1) @ (den @ X4)) @ (n_ts @ (num @ X4) @ (den @ X1)))|(n_some @ (diffprop @ (n_ts @ (num @ X1) @ (den @ X4)) @ (n_ts @ (num @ X4) @ (den @ X1))))|~((in @ X1 @ frac))|~((in @ X4 @ frac)))), inference(split_conjunct,[status(thm)],[c_0_40])).
4.59/1.17	thf(c_0_48, negated_conjecture, (in @ esk3_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_39])).
4.59/1.17	thf(c_0_49, negated_conjecture, ~((n_some @ (diffprop @ (n_ts @ (num @ esk3_0) @ (den @ esk1_0)) @ (n_ts @ (num @ esk1_0) @ (den @ esk3_0))))), inference(split_conjunct,[status(thm)],[c_0_39])).
4.59/1.17	thf(c_0_50, plain, ![X5:$i, X4:$i, X1:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ X5) @ (den @ X1)) @ (n_ts @ (num @ X1) @ (den @ X5))))|~((e_is @ nat @ (n_ts @ (num @ X1) @ (den @ X4)) @ (n_ts @ (num @ X4) @ (den @ X1))))|~((n_some @ (diffprop @ (n_ts @ (num @ X5) @ (den @ X4)) @ (n_ts @ (num @ X4) @ (den @ X5)))))|~((in @ X5 @ frac))|~((in @ X4 @ frac))|~((in @ X1 @ frac)))), inference(split_conjunct,[status(thm)],[c_0_41])).
4.59/1.17	thf(c_0_51, negated_conjecture, ((n_some @ (diffprop @ (n_ts @ (num @ esk3_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk3_0))))|(e_is @ nat @ (n_ts @ (num @ esk2_0) @ (den @ esk3_0)) @ (n_ts @ (num @ esk3_0) @ (den @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_39])).
4.59/1.17	thf(c_0_52, plain, ![X1:$i, X4:$i]:((~((n_some @ (diffprop @ (n_ts @ (num @ X1) @ (den @ X4)) @ (n_ts @ (num @ X4) @ (den @ X1)))))|~((n_some @ (diffprop @ (n_ts @ (num @ X4) @ (den @ X1)) @ (n_ts @ (num @ X1) @ (den @ X4)))))|~((in @ X1 @ frac))|~((in @ X4 @ frac)))), inference(split_conjunct,[status(thm)],[c_0_38])).
4.59/1.17	thf(c_0_53, negated_conjecture, ((n_some @ (diffprop @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)) @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0))))|~((n_some @ (diffprop @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_43]), c_0_44]), c_0_45])])).
4.59/1.17	thf(c_0_54, plain, ![X1:$i, X5:$i, X4:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ X5) @ (den @ X4)) @ (n_ts @ (num @ X4) @ (den @ X5))))|~((n_some @ (diffprop @ (n_ts @ (num @ X1) @ (den @ X4)) @ (n_ts @ (num @ X4) @ (den @ X1)))))|~((n_some @ (diffprop @ (n_ts @ (num @ X5) @ (den @ X1)) @ (n_ts @ (num @ X1) @ (den @ X5)))))|~((in @ X5 @ frac))|~((in @ X1 @ frac))|~((in @ X4 @ frac)))), inference(split_conjunct,[status(thm)],[c_0_41])).
4.59/1.17	thf(c_0_55, negated_conjecture, (n_some @ (diffprop @ (n_ts @ (num @ esk1_0) @ (den @ esk3_0)) @ (n_ts @ (num @ esk3_0) @ (den @ esk1_0)))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46, c_0_47]), c_0_48]), c_0_45])]), c_0_49])).
4.59/1.17	thf(c_0_56, negated_conjecture, ![X1:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ esk3_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk3_0))))|(n_some @ (diffprop @ (n_ts @ (num @ X1) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ X1))))|~((n_some @ (diffprop @ (n_ts @ (num @ X1) @ (den @ esk3_0)) @ (n_ts @ (num @ esk3_0) @ (den @ X1)))))|~((in @ X1 @ frac)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_51]), c_0_48]), c_0_44])])).
4.59/1.17	thf(c_0_57, negated_conjecture, ~((n_some @ (diffprop @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_53]), c_0_44]), c_0_45])])).
4.59/1.17	thf(c_0_58, negated_conjecture, ![X1:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ esk1_0) @ (den @ X1)) @ (n_ts @ (num @ X1) @ (den @ esk1_0))))|~((n_some @ (diffprop @ (n_ts @ (num @ esk3_0) @ (den @ X1)) @ (n_ts @ (num @ X1) @ (den @ esk3_0)))))|~((in @ X1 @ frac)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54, c_0_55]), c_0_45]), c_0_48])])).
4.59/1.17	thf(c_0_59, negated_conjecture, (n_some @ (diffprop @ (n_ts @ (num @ esk3_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk3_0)))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56, c_0_55]), c_0_45])]), c_0_57])).
4.59/1.17	thf(c_0_60, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_59]), c_0_44])]), c_0_57]), ['proof']).
4.59/1.17	# SZS output end CNFRefutation
4.59/1.17	# Parsed axioms                        : 569
4.59/1.17	# Removed by relevancy pruning/SinE    : 395
4.59/1.17	# Initial clauses                      : 240
4.59/1.17	# Removed in clause preprocessing      : 9
4.59/1.17	# Initial clauses in saturation        : 231
4.59/1.17	# Processed clauses                    : 1647
4.59/1.17	# ...of these trivial                  : 25
4.59/1.17	# ...subsumed                          : 717
4.59/1.17	# ...remaining for further processing  : 905
4.59/1.17	# Other redundant clauses eliminated   : 1
4.59/1.17	# Clauses deleted for lack of memory   : 0
4.59/1.17	# Backward-subsumed                    : 49
4.59/1.17	# Backward-rewritten                   : 17
4.59/1.17	# Generated clauses                    : 9670
4.59/1.17	# ...of the previous two non-redundant : 9315
4.59/1.17	# ...aggressively subsumed             : 0
4.59/1.17	# Contextual simplify-reflections      : 117
4.59/1.17	# Paramodulations                      : 9661
4.59/1.17	# Factorizations                       : 0
4.59/1.17	# NegExts                              : 0
4.59/1.17	# Equation resolutions                 : 3
4.59/1.17	# Total rewrite steps                  : 2302
4.59/1.17	# Propositional unsat checks           : 0
4.59/1.17	#    Propositional check models        : 0
4.59/1.17	#    Propositional check unsatisfiable : 0
4.59/1.17	#    Propositional clauses             : 0
4.59/1.17	#    Propositional clauses after purity: 0
4.59/1.17	#    Propositional unsat core size     : 0
4.59/1.17	#    Propositional preprocessing time  : 0.000
4.59/1.17	#    Propositional encoding time       : 0.000
4.59/1.17	#    Propositional solver time         : 0.000
4.59/1.17	#    Success case prop preproc time    : 0.000
4.59/1.17	#    Success case prop encoding time   : 0.000
4.59/1.17	#    Success case prop solver time     : 0.000
4.59/1.17	# Current number of processed clauses  : 692
4.59/1.17	#    Positive orientable unit clauses  : 72
4.59/1.17	#    Positive unorientable unit clauses: 2
4.59/1.17	#    Negative unit clauses             : 10
4.59/1.17	#    Non-unit-clauses                  : 608
4.59/1.17	# Current number of unprocessed clauses: 7928
4.59/1.17	# ...number of literals in the above   : 63825
4.59/1.17	# Current number of archived formulas  : 0
4.59/1.17	# Current number of archived clauses   : 212
4.59/1.17	# Clause-clause subsumption calls (NU) : 233803
4.59/1.17	# Rec. Clause-clause subsumption calls : 26419
4.59/1.17	# Non-unit clause-clause subsumptions  : 808
4.59/1.17	# Unit Clause-clause subsumption calls : 1259
4.59/1.17	# Rewrite failures with RHS unbound    : 0
4.59/1.17	# BW rewrite match attempts            : 126
4.59/1.17	# BW rewrite match successes           : 8
4.59/1.17	# Condensation attempts                : 1647
4.59/1.17	# Condensation successes               : 8
4.59/1.17	# Termbank termtop insertions          : 554103
4.59/1.17	
4.59/1.17	# -------------------------------------------------
4.59/1.17	# User time                : 0.544 s
4.59/1.17	# System time              : 0.016 s
4.59/1.17	# Total time               : 0.559 s
4.59/1.17	# Maximum resident set size: 6628 pages
4.59/1.18	
4.59/1.18	# -------------------------------------------------
4.59/1.18	# User time                : 0.559 s
4.59/1.18	# System time              : 0.019 s
4.59/1.18	# Total time               : 0.578 s
4.59/1.18	# Maximum resident set size: 2756 pages
4.59/1.18	% E---3.1 exiting
4.59/1.18	EOF